An Adaptive SAT Solver
نویسندگان
چکیده
This proposal outlines the creation of an adaptive algorithm for the Propositional Satisfiability Problem (SAT). The SAT problem is of great importance in theoretical computer science and verification. The proposed algorithm, or solver, uses the well-known DPLL approach coupled with a variety of optimizations and extensions which are selectively turned on and off during runtime to adapt to the problem at hand.
منابع مشابه
First report on an adaptive density based branching rule for DLL-like SAT solvers, using a database for mixed random conjunctive normal forms created using the Advanced Encryption Standard (AES)
We introduce an adaptive density-based heuristics hA for a given (DLLlike, otherwise arbitrary) SAT solver A, leading to a (hopefully) improved SAT solver A0. The determination of hA is motivated by a generalised threshold conjecture for random formulas, and exploits a database for satis ability and hardness of random formulas. To build up such a (large) database, a new reliable pseudo-random f...
متن کاملAdaptive Restart Control for Conflict Driven SAT Solvers
As the SAT competition has shown, frequent restarts improve the speed of SAT solvers tremendously, particularly on satisfiable industrial instances. This paper presents a novel adaptive technique that measures the agility of the search process dynamically, which in turn is used to control the restart frequency. Experiments demonstrate, that this new dynamic restart strategy improves speed of ou...
متن کاملThe International SAT Solver Competitions
is satisfiable is one of the most fundamental problems in computer science, known as the canonical NP-complete Boolean satisfiability (SAT) problem (Biere et al. 2009). In addition to its theoretical importance, major advances in the development of robust implementations of decision procedures for SAT, SAT solvers, have established SAT as an important declarative approach for attacking various ...
متن کاملFrom Total Assignment Enumeration to Modern SAT Solver
A new framework for presenting and analyzing the functionality of a modern DLL-based SAT solver is proposed. Our approach exploits the inherent relation between backtracking and resolution. We show how to derive the algorithm of a modern SAT solver from DLL stepby-step. We analyze the inference power of Boolean Constraint Propagation, Non-Chronological Backtracking and 1UIP-based Conflict-Direc...
متن کاملversat: A Verified Modern SAT Solver
This paper presents versat, a formally verified SAT solver incorporating the essential features of modern SAT solvers, including clause learning, watched literals, optimized conflict analysis, non-chronological backtracking, and decision heuristics. Unlike previous related work on SAT-solver verification, our implementation uses efficient low-level data structures like mutable C arrays for clau...
متن کامل